Wavelength Assignment for Light-tree Protection in Wdm Optical Networks

In this paper, we address the wavelength assignment problem for light-tree protection under different traffic models. For static traffic, we formulate the problem mathematically and propose two new heuristics (tabu search and iterated hill-climber) to solve it. For dynamic traffic, in contrast to previous work, we analyze the traffic characteristics and propose a Low Cost First Serve (LCFS) strategy to maximize the gain and throughput of network systems. Numerical results show our heuristics can achieve good performance in terms of session blocking probability.